A method for constructing diagonally dominant preconditioners based on Jacobi rotations
نویسندگان
چکیده
A method is presented to make a given matrix strictly diagonally dominant as much as possible based on Jacobi rotations in this paper. The strictly diagonally dominant rows are used to build a preconditioner for some iterative method. Roundoff error analysis of the method is also given. The numerical tests illustrate that the method works very well even for very ill-conditioned linear systems. AMS subject classification:65F10
منابع مشابه
The Jacobi-Davidson Method for Eigenvalue and Generalized Eigenvalue Problems
We consider variants of Davidson's method for the iterative computation of one or more eigenvalues and their corresponding eigenvectors of an n n matrix A. The original Davidson method 3], for real normal matrices A, may be viewed as an accelerated Gauss-Jacobi method, and the success of the method seems to depend quite heavily on diagonal dominance of A 3, 4, 17]. In the hope to enlarge the sc...
متن کاملMaximum-weight-basis preconditioners
This paper analyzes a novel method for constructing preconditioners for diagonally-dominant symmetric positivedefinite matrices. The method discussed here is based on a simple idea: we construct M by simply dropping offdiagonal nonzeros from A and modifying the diagonal elements to maintain a certain row-sum property. The preconditioners are extensions of Vaidya’s augmented maximum-spanning-tre...
متن کاملBlock-Relaxation Methods for 3D Constant-Coefficient Stencils on GPUs and Multicore CPUs
Block iterative methods are extremely important as smoothers for multigrid methods, as preconditioners for Krylov methods, and as solvers for diagonally dominant linear systems. Developing robust and efficient smoother algorithms suitable for current and evolving GPU and multicore CPU systems is a significant challenge. We address this issue in the case of constant-coefficient stencils arising ...
متن کاملTEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF COMPUTER SCIENCE Analysis, Implementation, and Evaluation of Vaidya’s Preconditioners
A decade ago Pravin Vaidya proposed a new class of preconditioners and a new technique for analyzing preconditioners. Preconditioners are essentially easy-to-compute approximate inverses of matrices that are used to speed up iterative linear solvers. Vaidya proposed several families of preconditioners. The simplest one is based on maximum spanning trees (MST) of the underlying graph of the matr...
متن کاملSolving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners
We show in this note how support preconditioners can be applied to a class of linear systems arising from use of the finite element method to solve linear elliptic problems. Our technique reduces the problem, which is symmetric and positive definite, to a symmetric positive definite diagonally dominant problem. Significant theory has already been developed for preconditioners in the diagonally ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 174 شماره
صفحات -
تاریخ انتشار 2006